Asynchronously automatic languages and groups
نویسنده
چکیده
Let A be a finite alphabet and let L ⊂ (A∗)n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an asynchronous n-tape automaton, and it is weakly regular if it is accepted by a non-deterministic asynchronous n-tape automaton. We investigate the closure properties of the classes of regular, quasi-regular, and weakly regular languages under first-order logic, and apply these observations to an open decidability problem in automatic group theory.
منابع مشابه
Formal Language Theory and the Geometry of 3-manifolds
Automatic groups were introduced in connection with geometric problems, in particular with the study of fundamental groups of 3-manifolds. In this article the class of automatic groups is extended to include the fundamental group of every compact 3-manifold which satisfies Thurston’s geometrization conjecture. Toward this end the class CA of asynchronously A−combable groups is introduced and st...
متن کاملThe Impact of Mediational Artifact Types on EFL Learners’ Writing Complexity: Collaboration vs. Asynchronous Artifacts
The present study was an attempt to investigate the significance of environmental changes on the develo p- ment of writing in English as a Foreign Language (EFL) context with respect to the individual. This study also compared the impacts of collaboration and asynchronous computer mediation (ACM) on the writing complexity of EFL learners. To this end, three intact writing classes were designate...
متن کاملGroups with Context-Free Conjugacy Problems
The conjugacy problem and the inverse conjugacy problem of a finitely generated group are defined, from a language theoretic point of view, as sets of pairs of words. An automaton might be obliged to read the two input words synchronously, or could have the option to read asynchronously. Hence each class of languages gives rise to four classes of groups; groups whose (inverse) conjugacy problem...
متن کاملFinitely Presented Subgroups of Automatic Groups and Their Isoperimetric Functions
We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even asynchronously automatic. We can also arrange that such subgroups satisfy, at best, an exponential isoperimetric inequality.
متن کاملAlgorithms and Topology of Cayley Graphs for Groups
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. A comparison with automatic groups is given. Another charact...
متن کامل